Essays on the Complexity of Voting Manipulation
نویسنده
چکیده
منابع مشابه
Comparison of the effects of Written Corrective Feedback and Task-complexity Manipulation on the Grammatical Accuracy of EFL learners’ Writing
This study compared the effects of teacher-provided direct and indirect written corrective feedback and manipulation of resource-directing dimensions of task cognitive complexity along +/- Here and Now condition on the grammatical accuracy of Iranian intermediate EFL learners’ narrative writing tasks. There were 45 participants in the study who were randomly assigned to three experimental group...
متن کاملTask Complexity Manipulation and Accuracy in Writing Performance
This study aimed to investigate the impact of task sequencing, along +/- reasoning demands dimension, on writing task performance in terms of accuracy. The study was motivated by Robinson’s Cognition Hypothesis (CH) as well as previous studies investigating the relationships between task complexity and second language production. The participants of the study were 90 intermediate students at t...
متن کاملTask Complexity Manipulation and EFL learners’ interactions in the process of collaborative pre-planning
Today, learners’ interaction and collaborative task performance have attracted increasing attention from language teachers and researchers. The present study investigated whether collaborative pre-planning, task complexity manipulation, and language proficiency level play a role in learners’ interactions. To this end, 128 EFL learners from two different language proficiency levels carried out t...
متن کاملManipulation Can Be Hard in Tractable Voting Systems Even for Constant-Sized Coalitions
Voting theory has become increasingly integrated with computational social choice and multiagent systems. Computational complexity has been extensively used as a shield against manipulation of voting systems, however for several voting schemes this complexity may cause calculating the winner to be computationally difficult. Of the many voting systems that have been studied with regard to electi...
متن کاملComplexity of and algorithms for the manipulation of Borda, Nanson's and Baldwin's voting rules
We investigate manipulation of the Borda voting rule, as well as two elimination style voting rules, Nanson’s and Baldwin’s voting rules, which are based on Borda voting. We argue that these rules have a number of desirable computational properties. For unweighted Borda voting, we prove that it is NP-hard for a coalition of two manipulators to compute a manipulation. This resolves a long-standi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016